package binarySearch;
/*
* 斐波那契查找
* */
public class FibonacciSearch {

    public static int maxSize = 20;
    public static void main(String[] args) {

    }


    public static int[] fib(){
        int[] f = new int[maxSize];
        f[0] = 1;
        f[1] = 2;

        for (int i = 2; i < maxSize; i++) {
            f[i] = f[i-1]+f[i-2];
        }

        return f;
    }
}
